On closed‐form solutions to the 4D nearest rotation matrix problem

نویسندگان

چکیده

In this paper, we address the problem of restoring orthogonality a numerically noisy 4D rotation matrix by finding its nearest (in Frobenius norm) correct matrix. This can be straightforwardly solved using Singular Value Decomposition (SVD). Nevertheless, to avoid numerical methods, present two new closed-form methods. One relies on direct minimization mentioned norm, and other passage double quaternion representation. A comparison these methods with respect SVD reveals that method based representation is superior in all aspects.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structure method for solving the nearest Euclidean distance matrix problem

*Correspondence: [email protected] Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia Abstract A matrix with zero diagonal is called a Euclidean distance matrix when the matrix values are measurements of distances between points in a Euclidean space. Because of data errors such a matrix may not be exactly Euclidean and it is desira...

متن کامل

Computing the Nearest Correlation Matrix—A Problem from Finance

Given a symmetric matrix what is the nearest correlation matrix, that is, the nearest symmetric positive semidefinite matrix with unit diagonal? This problem arises in the finance industry, where the correlations are between stocks. For distance measured in two weighted Frobenius norms we characterize the solution using convex analysis. We show how the modified alternating projections method ca...

متن کامل

New Matrix Model Solutions to the Kac-schwarz Problem

We examine the Kac-Schwarz problem of specification of point in Grassmannian in the restricted case of gap-one first-order differential Kac-Schwarz operators. While the pair of constraints satisfying [K1,W ] = 1 always leads to Kontsevich type models, in the case of [K1,W ] = W the corresponding KP τ -functions are represented as more sophisticated matrix integrals.

متن کامل

On the job rotation problem

The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem value is maximum. No polynomial algorithm is known for solving this problem if k is an input variable. We analyse JRP and present polynomial solution methods for a number of special cases.

متن کامل

On the Nearest Singular Matrix Pencil

Given a regular matrix pencil A + μE, we consider the problem of determining the nearest singular matrix pencil with respect to the Frobenius norm. We present new approaches based on the solution of matrix differential equations for determining the nearest singular pencil A+∆A+ μ(E +∆E), one approach for general singular pencils and another one such that A+∆A and E + ∆E have a common left/right...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Methods in The Applied Sciences

سال: 2022

ISSN: ['1099-1476', '0170-4214']

DOI: https://doi.org/10.1002/mma.8524